An Effective Local Routing Strategy on the Communication Network

In this paper, we propose an effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential cut-off exponent K. We assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than K, and is a constantC0 otherwise. It is found that by tuning the parameter α, the scale-free network capacity measured by the order parameter is considerably enhanced compared to the normal nearest-neighbor strategy. Traffic dynamics both near and far away from the critical generating rate Rc are discussed. Simulation results demonstrate that the optimal performance of the system corresponds to α = −0.5. Due to the low cost of acquiring nearest-neighbor information and the strongly improved network capacity, our strategy may be useful and reasonable for the protocol designing of modern communication networks.